Inverse Expander Mixing for Hypergraphs
نویسندگان
چکیده
We formulate and prove inverse mixing lemmas in the settings of simplicial complexes and k-uniform hypergraphs. In the hypergraph setting, we extend results of Bilu and Linial for graphs. In the simplicial complex setting, our results answer a question of Parzanchevski et al.
منابع مشابه
On codes from hypergraphs
We propose a new family of asymptotically good binary codes, generalizing previous constructions of expander codes to -uniform hypergraphs. We also describe an efficient decoding algorithm for these codes, that for a certain region of rates improves the known results for decoding distance of expander codes. The construction is based on hypergraphs with a certain “expansion” property called here...
متن کاملMixing in High-Dimensional Expanders
We establish a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to as mixing, or pseudorandomness). Recently, an analogue of this Lemma was proved for simplicial complexes of arbitrary dimension, provided that the skeleto...
متن کاملLecture 8: Spectral Expansion Ii
Remark Here is an interpretation of Theorem 2. Consider the following two random experiments. Experiment 1: pick a random vertex u ∈ V of the graph G, and then pick one of its d neighbors v, uniformly at random. Experiment 2: pick a random vertex u ∈ V and then pick a random vertex v ∈ V . What is the probability of picking an ordered pair (u, v) such that u ∈ B and v ∈ C? For Experiment 1, it ...
متن کاملNon-backtracking random walks mix faster
We compute the mixing rate of a non-backtracking random walk on a regular expander. Using some properties of Chebyshev polynomials of the second kind, we show that this rate may be up to twice as fast as the mixing rate of the simple random walk. The closer the expander is to a Ramanujan graph, the higher the ratio between the above two mixing rates is. As an application, we show that if G is a...
متن کاملHigh-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016